Index-based maximum likelihood RaptorQ code decoder
نویسندگان
چکیده
منابع مشابه
Fast Maximum-Likelihood Decoder for 4*4 Quasi-Orthogonal Space-Time Block Code
This letter introduces two fast maximum-likelihood (ML) detection methods for 4*4 quasi-orthogonal space-time block code (QOSTBC). The first algorithm with a relatively simple design exploits structure of quadrature amplitude modulation (QAM) constellations to achieve its goal and the second algorithm, though somewhat more complex, can be applied to any arbitrary constellation. Both decoders ut...
متن کاملNoncoherent sequential code acquisition based on simplified maximum likelihood ratios
In this paper, we consider the noncoherent code acquisition problem using sequential schemes. To alleviate the computational complexity of the maximum likelihood method, simplified schemes are proposed and analyzed for the truncated sequential probability ratio test. The performance of the simplified and original schemes are compared in additive white Gaussian noise and slowly varying fading ch...
متن کاملA Fast Maximum-Likelihood Decoder for Convolutional Codes
The lazy Viterbi decoder is a maximum-likelihood decoder for block and stream convolutional codes. For many codes of practical interest, under reasonable noise conditions, the lazy decoder is much faster than the original Viterbi decoder. For a code of constraint length , the lazy algorithm is about 50% faster than an optimized implementation of the Viterbi decoder whenever SNR dB. Moreover, wh...
متن کاملA Decision-Feedback Maximum-Likelihood Decoder for Fading Channels
We propose a novel decision-feedback maximum-likelihood decoder for fading channels. These channels have memory due to the fading correlation, and the complexity of maximum-likelihood decoding for such channels grows exponentially with memory length. Therefore, in practice, the encoded bit stream is typically interleaved prior to transmission and the deinterleaved bit stream is decoded as for a...
متن کاملA low-complexity maximum likelihood decoder for tail-biting trellis
Tail-biting trellises are defined on a circular time axis and can have a smaller number of states than equivalent conventional trellises. Existing circular Viterbi algorithms (CVAs) on the tail-biting trellis are non-convergent and sub-optimal. In this study, we show that the net path metric of each tail-biting path is lower-bounded during the decoding process of the CVA. This property can be a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Communications Express
سال: 2015
ISSN: 2187-0136
DOI: 10.1587/comex.4.233